A Review: Area and Delay Efficient Pre- Encoded Multipliers Based on Non- Redundant Radix-4 Encoding
نویسندگان
چکیده
In this paper,we introduce an architecture of pre-encoded multiplier. The radix-4 modular multiplier can be used to implement fast computer applications, e.g RSA cryptosystem and to reduce the number of iterations and pipelining. The performance of these algorithms is primarily determined by the efficient implementation of the modular multiplication and exponentiation. Discussed a Booth's Radix-2 multiplier and estimated its delay, area and power. A comparison analysis of Radix-2 and Radix-4 algorithm as it seems more suitable for the design by using different adder architectures like RCA and CLA.
منابع مشابه
Area and Power Efficient Booth’s Multipliers Based on Non Redundant Radix-4 Signed- Digit Encoding
In this paper, we introduce an architecture of pre-encoded multipliers for Digital Signal Processing applications based on off-line encoding of coefficients. To this extend, the Non-Redundant radix-4 Signed-Digit (NR4SD) encoding technique, which uses the digit values {-1, 0, +1, +2} or {-2,-1,0,+1}, is proposed leading to a multiplier design with less complex partial products implementation. E...
متن کاملA New Architecture Design Implementation of Non- Redundant Radix-4 Signed Multiplier Using HDL
This paper briefly presents architecture of pre-encoded multipliers for Digital Signal Processing applications based on off-line encoding of coefficients. Complex arithmetic operations are widely used in Digital Signal Processing (DSP) applications. To this extend, the Non-Redundant radix-4 Signed-Digit (NR4SD) encoding technique, which uses the digit values (-1;0;+1;+2) or (-2;-1; 0;+1) is pro...
متن کاملDesign of Low Power and Area Non-Redundant Radix-4 Signed- Digit (NR4SD) Encoding
In this paper, we present an engineering of preencoded multipliers for Digital Signal Processing applications based on disconnected encoding of coefficients. To this augment, the Non-Redundant radix-4 Signed-Digit (NR4SD) encoding method, which utilizes the digit values {-1, 0, +1, +2} or {-2,1,0,+1} is proposed prompting to a multiplier outline with less unpredictable incomplete items executio...
متن کاملASIC Design of Butterfly Unit Based on Non-Redundant and Redundant Algorithm
Fast Fourier Transform (FFT) processors employed with pipeline architecture consist of series of Processing Elements (PE) or Butterfly Units (BU). BU or PE of FFT performs multiplication and addition on complex numbers. This paper proposes a single BU to compute radix-2, 8 point FFT in the time domain as well as frequency domain by replacing a series of PEs. This BU comprises of fused floating ...
متن کاملLow-Power Radix-8 Booth Encoded Modulo 2n − 1 Multiplier with Adaptive Delay
A special moduli set Residue Number System (RNS) of high dynamic range (DR) can speed up the execution of very-large word-length repetitive multiplications found in applications like public key cryptography. The modulo 2n − 1 multiplier is usually the noncritical datapath among all modulo multipliers in such high-DR RNS multiplier. This timing slack can be exploited to reduce the system area an...
متن کامل